Choosing optimal pattern matching algorithm for designing production system
نویسندگان
چکیده
منابع مشابه
Designing optimal- and fast-on-average pattern matching algorithms
Given a pattern w and a text t, the speed of a pattern matching algorithm over t with regard to w, is the ratio of the length of t to the number of text accesses performed to search w into t. We first propose a general method for computing the limit of the expected speed of pattern matching algorithms, with regard to w, over iid texts. Next, we show how to determine the greatest speed which can...
متن کاملOptimal pattern matching algorithms
We study a class of finite state machines, called w-matching machines, which yield to simulate the behavior of pattern matching algorithms while searching for a pattern w. They can be used to compute the asymptotic speed, i.e. the limit of the expected ratio of the number of text accesses to the length of the text, of algorithms while parsing an iid text to find the pattern w. Defining the orde...
متن کاملImproved Single Keyword Pattern Matching Algorithm for Intrusion Detection System
With the spreading of the internet and online procedures requesting a secure channel, it has become an inevitable requirement to provide the network security. It is very clear that firewalls are not enough to secure a network completely because the attacks committed from outside of the network are stopped whereas inside attacks are not. This is the situation where intrusions detection systems (...
متن کاملA Fast Pattern-Matching Algorithm for Network Intrusion Detection System
We present a multi-gigabit rate multiple pattern-matching algorithm with TCAM that enables protecting against malicious attacks in a high-speed network. The proposed algorithm significantly reduces the number of TCAM lookups per payload with m-byte jumping window scheme. Due to the reduced number of TCAM lookups, we can easily achieve multi-gigabit rate for scanning the packet payload in order ...
متن کاملOptimal Pattern Matching on Meshes
Parallel pattern matching on a mesh-connected array of processors is considered. The problem is to nd all occurrences of a pattern in a text. The input text is a string of n symbols placed in a p n p n mesh, each processor storing one symbol. The pattern is stored similarly in a contiguous portion of the mesh. An algorithm solving the problem in time O(p n) is presented. It applies a novel tech...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Eastern-European Journal of Enterprise Technologies
سال: 2014
ISSN: 1729-4061,1729-3774
DOI: 10.15587/1729-4061.2014.23327